PTL: A model transformation language based on logic programming

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

mortality forecasting based on lee-carter model

over the past decades a number of approaches have been applied for forecasting mortality. in 1992, a new method for long-run forecast of the level and age pattern of mortality was published by lee and carter. this method was welcomed by many authors so it was extended through a wider class of generalized, parametric and nonlinear model. this model represents one of the most influential recent d...

15 صفحه اول

A Logic Programming Language Based on Binding Algebras

We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variable binding. The aim of this language is similar to Nadathur and Miller’s λProlog, which can also deal with binding structure by introducing λ-terms in higher-order logic. But the notion of binding used here is finer in a...

متن کامل

A Query Language for OWL based on Logic Programming

In this paper we investigate how to use logic programming (in particular, Prolog) as query language against OWL resources. Our query language will be able to retrieve data and meta-data about a given OWL based ontology. With this aim, firstly, we study how to define a query language based on a fragment of Description Logic, then we show how to encode the defined query language into Prolog by me...

متن کامل

Towards A Configuration Specification Language Based On Constraints Logic Programming

In this paper, we concentrate on describing a configuration specification language suitable for most of configuration problems. The language and the generated configuration task code are based on the key-component approach. The implementation of the language is based on the CLPFD library of SICStus Prolog. The language consists of a number of Prolog clauses, which are compiled into CLPFD constr...

متن کامل

PTL: A Propositional Typicality Logic

We introduce Propositional Typicality Logic (PTL), a logic for reasoning about typicality. We do so by enriching classical propositional logic with a typicality operator of which the intuition is to capture the most typical (or normal) situations in which a formula holds. The semantics is in terms of ranked models as studied in KLM-style preferential reasoning. This allows us to show that ratio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Logical and Algebraic Methods in Programming

سال: 2016

ISSN: 2352-2208

DOI: 10.1016/j.jlamp.2015.06.006